Adding more intelligence to the network routing problem: AntNet and Ga-agents
نویسندگان
چکیده
D P R AntNet and GA-agent algorithms are benchmarked against a series of dynamic network routing problems. Performance is characterized using multiple performance metrics on the Japanese backbone (NTTNET). NTTNET is used on account of the elongated topology presenting a more challenging routing problem than in the case of the American backbone, which is basically square. The AntNet scheme is found to provide the best routing ability providing global information is available and network security is not a factor. The GA-agent algorithm is shown to provide routing performance between the AntNet algorithm with global information and that without, whilst avoiding global information requirements and satisfying typical models of network security. # 2005 Published by Elsevier B.V.
منابع مشابه
Intelligent Packets for Dynamic Network Routing
A distributed GA (Genetic Algorithm) is designed for the packet switched network routing problem under minimal information, i.e., without information exchange, every node only knows the existence of its neighboring nodes. The requirements of such a problem mean that intelligent packets are required to possess more intelligence than was the norm. To this end a distributed GA approach is develope...
متن کاملA Quality of Service Routing Scheme for Packet Switched Networks based on Ant Colony Behavior
Quality of Service (QoS) guarantees must be supported in a network that intends to carry real-time multimedia traffic effectively. A key problem in providing QoS guarantees is routing which consists of finding a path in a network that satisfies several constraints such as bandwidth, delay, delay jitter, etc. This paper proposes a novel QoS routing scheme called AntNet-QoS which provides QoS by ...
متن کاملAntNet: A Mobile Agents Approach to Adaptive Routing
This paper introduces AntNet, a new routing algorithm for communications networks. AntNet is an adaptive, distributed, mobile-agents-based algorithm which was inspired by recent work on the ant colony metaphor. We apply AntNet to a datagram network and compare it with both static and adaptive state-of-the-art routing algorithms. We ran experiments for various paradigmatic temporal and spatial t...
متن کاملAntNet: Routing Algorithm for Data Networks based on Mobile Agents
AntNet is an innovative algorithm for packet routing in communication networks, originally proposed by M. Dorigo and G. Di Caro, in 1997. In AntNet, a group of mobile agents (or artificial ants) build paths between pair of nodes, exploring the network concurrently and exchanging obtained information to update the routing tables. This work analyzes AntNet and proposes improvements that were impl...
متن کاملFurther Investigation of Improved Antnet Routing Algorithm with Multiple Colonies
Antnet is a software agent based routing algorithm that is influenced by the unsophisticated and individual ants emergent behaviour. In real life, ants deposit some kind of chemical substance to mark the path that they used. Then on their way back they choose the path with the most pheromones which becomes the shortest path. Ants (nothing but software agents) in antnet are used to collect traff...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Appl. Soft Comput.
دوره 6 شماره
صفحات -
تاریخ انتشار 2006